A Test for the Consecutive Ones Property on Noisy Data
نویسندگان
چکیده
A (0,1)-matrix satisfies the consecutive ones property (COP) for the rows if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. The consecutive ones test is useful for DNA sequence assembly, for example, in the STS content mapping of YAC library, and in the Bactig assembly based on STS as well as EST
منابع مشابه
A Test for the Consecutive Ones Property on Noisy Data - Application to Physical Mapping and Sequence Assembly
A (0,1)-matrix satisfies the consecutive ones property (COP) for the rows if there exists a column permutation such that the ones in each row of the resultant matrix are consecutive. The consecutive ones test is useful for physical mapping and DNA sequence assembly, for example, in the STS content mapping of YAC library, and in the Bactig assembly based on STS as well as EST markers. The linear...
متن کاملA Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueker [1976] designed a linear time testing algorithm for this property based on a data structure called "PQ-trees". This procedure is quite complicated and the linear time amortized analysis is also rather involved. We de...
متن کاملOn Physical Mapping Algorithms - An Error-Tolerant Test for the Consecutive Ones Property
An important problem in physical mapping is to test the consecutive ones property of a (0,1)-matrix: that is, whether it is possible to permute the columns so that each row of the resulting matrix has the ones occur in a consecutive block. This is useful, for example, in probe hybridization for cosmid clones and in the STS content mapping of YAC library. The linear time algorithm by Booth and L...
متن کاملSet covering with almost consecutive ones property
In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecuti...
متن کاملConsecutive Ones Property Testing: Cut or Swap
Let C be a finite set of n elements and R = {R1, R2, . . . , Rm} a family of m subsets of C. The family R verifies the consecutive ones property if there exists a permutation P of C such that each Ri in R is an interval of P . There already exist several algorithms to test this property in O( ∑m i=1 |Ri|) time, all being involved. We present a simpler algorithm, based on a new partitioning scheme.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003